Breaking the Legend: Maxmin Fairness notion is no longer effective

In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated.Comment: 8 Page

Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks

The pervasiveness of the Internet and its applications lead to the potential increment of the users’ demands for more services with economical prices. The diversity of Internet traffic requires some classification and prioritisation since some traffic deserve much attention with less delay and loss compared to others. Current scheduling mechanisms are exposed to the trade-off between three major properties namely fairness, complexity and protection. Therefore, the question remains about how to improve the fairness and protection with less complex implementation. This research is designed to enhance scheduling mechanism by providing sustainability to the fairness and protection properties with simplicity in implementation; and hence higher service quality particularly for real-time applications. Extra elements are applied to the main fairness equation to improve the fairness property. This research adopts the restricted charge policy which imposes the protection of normal user. In terms of the complexity property, genetic algorithm has an advantage in holding the fitness score of the queue in separate storage space which potentially minimises the complexity of the algorithm. The integrity between conceptual, analytical and experimental approach verifies the efficiency of the proposed mechanism. The proposed mechanism is validated by using the emulation and the validation experiments involve real router flow data. The results of the evaluation showed fair bandwidth distribution similar to the popular Weighted Fair Queuing (WFQ) mechanism. Furthermore, better protection was exhibited in the results compared with the WFQ and two other scheduling mechanisms. The complexity of the proposed mechanism reached O(log(n)) which is considered as potentially low. Furthermore, this mechanism is limited to the wired networks and hence future works could improve the mechanism to be adopted in mobile ad-hoc networks or any other wireless networks. Moreover, more improvements could be applied to the proposed mechanism to enhance its deployment in the virtual circuits switching network such as the asynchronous transfer mode networks

Survey on the Event Orderings Semantics Used for Distributed System

Event ordering in distributed system (DS) is disputable and proactive subject in DS particularly with the emergence of multimedia synchronization. According to the literature, different type of event ordering is used for different DS mode such as asynchronous or synchronous. Recently, there are several novel implementation of these types introduced to fulfill the demand for establishing a certain order according to a specific criterion in DS with lighter complexity.Comment: 9 page

The effect of concurrent connection in the fairness and protection of scheduling mechanism in the internet

Current advance in all type of live technology makes its users greedier in demanding more services with fewer prices.This also, applied for network users who increase their hunger to network resources as the technology increase.The purpose of this paper is to explore and examine the impact of greedy users who initiate simultaneous connections to acquire the same file but from different destination.This method is actually been used by P2P, download accelerator software and others. To approach the aim of verifying the impact of concurrent connection, OPNET simulator is used and the results achieved and accumulated from the simulation is analyzed.The result of the simulation shows side effects of such behavior in the delay variation, end-to-end delay and hence the QoS.This research provides verification and validation for the negative impact of the misbehaved users in network performance, QoS and real-time applications although it has the limitation of implementation in simulation environment with static behavior.However, this study uses reliable topology and the run time is reasonable and justified to proof it’s significant.All findings which accumulated from the simulation is highly contributed to the knowledge of networking particularly in QoS enhancement since this result proof the importance of research in finding new solution to eliminate the miss-behaved effect and motivates scholar redirect their research toward fairer and protective network

A survey on the chronological evolution of timestamp schedulers in packet switching networks

The interest in solving the issue of congestion or flow control in network established from the first discovery and increase popularity of the Internet in 1967 or earlier. As the use of the network deployed and the popularity increase, the issue grows and the demand for an optimal or tentative solution becomes obvious. Since that time there has been an intensive effort from the scholars and researchers to solve the congestion control problem. The problem get worse by the engagement of novel traffic with different characteristics for application called realtime applications such as video and voice applications. Another cause of this demand is the user himself. The attempt in solving the congestion problem in network layer was popular in 90’s.This article will demonstrate chronologically how the attempts toward timestamp based scheduling in the packet-switch network have been evolved.Furthermore, the benefit and the drawbacks of using a mechanism will be presented. Also, a brief explanation of the mathematical, conceptual or implementation issue of a mechanism is given. The key success of the scheduler in the market will be highlighted. This paper will stimulate the research thinking to identify the importance and the ability of scheduling in routers to enhance quality of service (QoS) for real time application over other solution in several layers. In addition it will assist the researcher to distinguish the key failure of other proposed mechanisms which have not been implemented in real routers

Just queueing (JQ): Scheduling algorithm for the internet

Fairness in packets scheduling in routers is a fundamental objective for designing a scheduler. The magnificent WFQ, which approximate GPS to a distinctive level of accuracy, attempts to allocate the bandwidth fairly among the flows according to Maxmin principle and to source-destination fashion. Nevertheless,referring to Rawls’ method for theory of justice, “rank alternatives to the worst possible outcome”, could be inferred as the distribution of the congestion, in case of its incidence, rather than the fairness. This article reveals the discussion in displacing scholars’ attention from bandwidth allocation to distribution of the congestion or the charge. It introduces the conceptual framework of just queuing (JQ) principle

A comparative survey of scheduling mechanisms in the internet

As the Internet is rapidly growing and its popularity increases, users tend to use creative, timeconservative, entertained and economical technologies. Real-time applications such as online gaming, voice and video applications are becoming more popular. Research effort to improve scheduling mechanisms in routers is currently given less attention by network researchers. This trend is far behind in industrial implementation and standards institutions. This paper attempts to compare the development in this subject from academic, standards and industry point of views. The results show that there is an enormous difference between academic research and standards and market domains in term of the evolution of scheduling mechanis